Dissections, cuts and triangulations
نویسندگان
چکیده
: H F R Q V LG H U W ZR S U R E OH P V R Q G LV V H F W LR Q V R I S R O\J R Q V ,Q W K H p U V W S U R E OH P ZH F R Q V LG H U W K H P LQ LP X P Q X P E H U R I S LH F H V LQ G LV V H F W LQ J ZLW K U H F W LOLQ H D U J OD V V F X W V D Q P Q d P Q U H F W D Q J OH LQ W R D X Q LW V TX D U H $ U H F W D Q J OH LV F D OOH G V H P L LQ W H J H U LI H LW K H U LW V E D V H R U LW V K H LJ K W LV D Q LQ W H J H U ,Q W K H V H F R Q G S U R E OH P ZH V K R Z W K D W Q R W U LD Q J X OD W LR Q R I D U H J X OD U S R O\J R Q F D Q E H D G LV V H F W LR Q R I D Q R W K H U U H J X OD U S R O\J R Q R I W K H V D P H D U H D
منابع مشابه
Extremal Properties for Dissections of Convex 3-Polytopes
A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose vertices are among the vertices of the polytope. Triangulations are dissections that have the additional property that the set of all its simplices forms a simplicial complex. The size of a dissection is the number of d-simplices it contains. This paper compares triangulations of maximal size with dissecti...
متن کاملCounting polygon dissections in the projective plane
For each value of k ≥ 2, we determine the number pn of ways of dissecting a polygon in the projective plane into n subpolygons with k + 1 sides each. In particular, if k = 2 we recover a result of Edelman and Reiner (1997) on the number of triangulations of the Möbius band having n labelled points on its boundary. We also solve the problem when the polygon is dissected into subpolygons of arbit...
متن کاملEnumeration and limit laws of dissections on a cylinder
We compute the generating function for triangulations on a cylinder, with the restriction that all vertices belong to its boundary and that the intersection of a pair of different faces is either empty, a vertex or an edge. We generalize these results to maps with either constant ({k}-dissections) or unrestricted (unrestricted dissections) face degree. We apply singularity analysis to the resul...
متن کاملMinimal Simplicial Dissections and Triangulations of Convex 3-Polytopes
This paper addresses three questions related to minimal triangulations of a three-dimensional convex polytope P. • Can the minimal number of tetrahedra in a triangulation be decreased if one allows the use of interior points of P as vertices? • Can a dissection of P use fewer tetrahedra than a triangulation? • Does the size of a minimal triangulation depend on the geometric realization of P? Th...
متن کاملMinimal Simplicial Dissections and Triangulations of Convex
This paper addresses three questions related to minimal triangulations of a 3-dimensional convex polytope P . • Can the minimal number of tetrahedra in a triangulation be decreased if one allows the use of interior points of P as vertices? • Can a dissection of P use fewer tetrahedra than a triangulation? • Does the size of a minimal triangulation depend on the concrete realization of P ? The m...
متن کاملEfficient Regular Polygon Dissections
We study the minimum number g(m,n) (respectively, p(m, n)) of pieces needed to dissect a regular m-gon into a regular n-gon of the same area using glass-cuts (respectively, polygonal cuts). First we study regular polygon-square dissections and show that dn/2e − 2 ≤ g(4, n) ≤ n 2 + o(n) and dn/4e ≤ g(n, 4) ≤ n 2 + o(n) hold for sufficiently large n. We also consider polygonal cuts, i.e., the min...
متن کامل